Search results for "discrete [space-time]"
showing 10 items of 2035 documents
Patients' and physicians' preferences for type 2 diabetes mellitus treatments in Spain and Portugal: a discrete choice experiment.
2015
Objective To assess Spanish and Portuguese patients’ and physicians’ preferences regarding type 2 diabetes mellitus (T2DM) treatments and the monthly willingness to pay (WTP) to gain benefits or avoid side effects. Methods An observational, multicenter, exploratory study focused on routine clinical practice in Spain and Portugal. Physicians were recruited from multiple hospitals and outpatient clinics, while patients were recruited from eleven centers operating in the public health care system in different autonomous communities in Spain and Portugal. Preferences were measured via a discrete choice experiment by rating multiple T2DM medication attributes. Data were analyzed using the condit…
Spatial Memory Drives Foraging Strategies of Wolves, but in Highly Individual Ways
2022
The ability of wild animals to navigate and survive in complex and dynamic environments depends on their ability to store relevant information and place it in a spatial context. Despite the centrality of spatial memory, and given our increasing ability to observe animal movements in the wild, it is perhaps surprising how difficult it is to demonstrate spatial memory empirically. We present a cognitive analysis of movements of several wolves (Canis lupus) in Finland during a summer period of intensive hunting and den-centered pup-rearing. We tracked several wolves in the field by visiting nearly all GPS locations outside the den, allowing us to identify the species, location and timing of ne…
Inversion of the Triphenylamine Molecule
1964
Does ns2 Really Simulate MPLS Networks?
2008
Multi Protocol Label Switching (MPLS) is being used in many corporate networks and public infrastructures and as a backbone technology of many Autonomous Systems. Because of its importance, what is needed is to find out simulators able to simulate MPLS networks whose results reflect the real environment as much as possible. In this article, we will show real measurements from the Railway Infrastructure Administrator (ADIF, the Spanish railway infrastructure manager) MPLS network and we will compare them with the results obtained by the freeware simulator ns2. We will check the level of reliability provided by the simulator and we will know under which parameters its results will be similar …
Stoïlow’s theorem revisited
2020
Stoilow's theorem from 1928 states that a continuous, open, and light map between surfaces is a discrete map with a discrete branch set. This result implies that such maps between orientable surfaces are locally modeled by power maps z -> z(k) and admit a holomorphic factorization. The purpose of this expository article is to give a proof of this classical theorem having readers in mind that are interested in continuous, open and discrete maps. (C) 2019 Elsevier GmbH. All rights reserved. Peer reviewed
5,10-Dihydroindeno[2,1-a]indene
2019
The title compound, C16H12, crystallizes with four half molecules in the asymmetric unit, each of which is located on a crystallographic centre of inversion. The molecules are essentially planar. The crystal studied was a non-merohedral twin.
A decomposition approach for multidimensional knapsacks with family-split penalties
2022
The optimization of Multidimensional Knapsacks with Family-Split Penalties has been introduced in the literature as a variant of the more classical Multidimensional Knapsack and Multi-Knapsack problems. This problem deals with a set of items partitioned in families, and when a single item is picked to maximize the utility, then all items in its family must be picked. Items from the same family can be assigned to different knapsacks, and in this situation split penalties are paid. This problem arises in real applications in various fields. This paper proposes a new exact and fast algorithm based on a specific Combinatorial Benders Cuts scheme. An extensive experimental campaign computational…
New degrees of freedom for differential forms on cubical meshes
2022
We consider new degrees of freedom for higher order differential forms on cubical meshes. The approach is inspired by the idea of Rapetti and Bossavit to define higher order Whitney forms and their degrees of freedom using small simplices. We show that higher order differential forms on cubical meshes can be defined analogously using small cubes and prove that these small cubes yield unisolvent degrees of freedom. Significantly, this approach is compatible with discrete exterior calculus and expands the framework to cover higher order methods on cubical meshes, complementing the earlier strategy based on simplices.
Robust delay-dependent H∞ control of uncertain time-delay systems with mixed neutral, discrete, and distributed time-delays and Markovian switching p…
2011
Author's version of an article published in the journal: IEEE Transactions on Circuits and Systems I: Regular Papers. Also available from the publisher at: http://dx.doi.org/10.1109/tcsi.2011.2106090 The problem of robust mode-dependent delayed state feedback H ∞ control is investigated for a class of uncertain time-delay systems with Markovian switching parameters and mixed discrete, neutral, and distributed delays. Based on the LyapunovKrasovskii functional theory, new required sufficient conditions are established in terms of delay-dependent linear matrix inequalities for the stochastic stability and stabilization of the considered system using some free matrices. The desired control is …
Jauni ieskati kvantu automātu stāvokļu skaita efektivitātē
2022
Kvantu galīgi automāti var sasniegt eksponenciālu stāvokļu skaitu efektivitāti, salīdzinot ar determinētiem galīgiem automātiem. Viena problēma, kurā ir zināms, ka kvantu galīgiem automātiem ir eksponenciālas priekšrocības, ir MODn problēma, taču nav zināma metode, kā uzkonstruēt tādu kvantu automātu. Šajā darbā eksponenciāli efektīvie MODn algoritmi tiek vispārināti jaunā algoritmā, kas samazina vajadzīgo stāvokļu skaitu. Jaunā algoritma saaistības ar esošiem virzieniem literatūrā tiek aprakstītas, un tiek piedāvātas divas jaunas skaitļu virknes, kuras varētu izmantot, lai uzkonstruētu tādus kvantu automātus.